- syntactically definable
- мат.синтактически определимый
English-Russian scientific dictionary. 2008.
syntactically definable
Смотреть что такое "syntactically definable" в других словарях:
Intuitionistic logic — Intuitionistic logic, or constructive logic, is a symbolic logic system differing from classical logic in its definition of the meaning of a statement being true. In classical logic, all well formed statements are assumed to be either true or… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
African American Vernacular English — African American topics History Atlantic slave trade · Maafa Slavery in the United States Military history of African Americans … Wikipedia
Subnetwork — Creating a subnet by dividing the host identifier A subnetwork, or subnet, is a logically visible subdivision of an IP network.[1] The practice of dividing a network into subnetworks is called subnetting. All computers that belong to a subnet are … Wikipedia
Tarski's axioms — Tarski s axioms, due to Alfred Tarski, are an axiom set for the substantial fragment of Euclidean geometry, called elementary, that is formulable in first order logic with identity, and requiring no set theory. Other modern axiomizations of… … Wikipedia
Comparison of ALGOL 68 and C++ — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Combinatory categorial grammar — (CCG) is an efficiently parseable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate argument structure, quantification and… … Wikipedia
